Mining Functional Dependencies with Degrees of Satisfaction in Databases
نویسندگان
چکیده
1 Partly supported by “Nation’s Outstanding Young Scientists Funds” of China (No. 79925001), the Bilateral Scientific and Technological Cooperation Programme Between China and Flandres (174B0201) and Tsinghua’s Soft Science Key Project on E-Commerce. 2 Corresponding author. Email: [email protected]. Abstract Mining functional dependencies (FDs) is valuable in analyzing the relationships among items in databases. This paper presents a notion of FDs with degrees of satisfaction, i.e., (FDs)d, aimed at reflecting the extent to which FDs are satisfied by given database relations. Furthermore, some desirable properties and derivatives are derived. Consequently, an algorithm is proposed to deal with large-scale databases from a set of qualified (FDs)d using data mining approaches.
منابع مشابه
Efficient discovery of functional dependencies with degrees of satisfaction
Functional dependency (FD) is an important type of semantic knowledge reflecting integrity constraints in databases, and has nowadays attracted an increasing amount of research attention in data mining. Traditionally, FD is defined in the light of precise or complete data, and can hardly tolerate partial truth due to imprecise or incomplete data (such as noises, nulls, etc.) that may often exis...
متن کاملDefining and Mining Functional Dependencies in Probabilistic Databases
Functional dependencies – traditional, approximate and conditional are of critical importance in relational databases, as they inform us about the relationships between attributes. They are useful in schema normalization, data rectification and source selection. Most of these were however developed in the context of deterministic data. Although uncertain databases have started receiving attenti...
متن کاملImprecise Database Inference Using Functional Dependencies
Knowledge discovery in databases can be enhanced by augmenting them with \catalytic relations" conveying external common sense knowledge. Catalytic inference analysis ? the systematic analysis of inference closures in databases augmented with catalytic information ? uncovers new facts and rules, and latent inference channels. This paper presents a formalism for analyzing imprecise inference bas...
متن کاملComparison of Linguistic Summaries and Fuzzy Functional Dependencies Related to Data Mining
Data mining methods based on fuzzy logic have been developed recently and have become an increasingly important research area. In this chapter, the authors examine possibilities for discovering potentially useful knowledge from relational database by integrating fuzzy functional dependencies and linguistic summaries. Both methods use fuzzy logic tools for data analysis, acquiring, and represent...
متن کاملDiscovery of functional and approximate functional dependencies in relational databases
This study develops the foundation for a simple, yet efficient method for uncovering functional and approximate functional dependencies in relational databases. The technique is based upon the mathematical theory of partitions defined over a relation’s row identifiers. Using a levelwise algorithm the minimal non-trivial functional dependencies can be found using computations conducted on intege...
متن کامل